Representing algebraic integers as linear combinations of units

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing algebraic integers as linear combinations of units

In this paper we consider representations of algebraic integers of a number field as linear combinations of units with coefficients coming from a fixed small set, and as sums of elements having small norms in absolute value. These theorems can be viewed as results concerning a generalization of the so-called unit sum number problem, as well. Beside these, extending previous related results we g...

متن کامل

Representing integers as linear combinations of powers

At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. (See his paper in the present volume.) He proposed some related problems on the representation of integers by sums or differences of powers of 2 and of 3. In this note we prove some results on this problem and the more general problem about the representation by line...

متن کامل

Linear Combinations of Sets of Consecutive Integers

Let k-l,ml,..~+k denote non-negative integers, and suppose the greatest common divisor of ml,...,mk is 1 . We show that if '1, "',sk are sufficiently long blocks of consecutive integers, then the set mlSl+ . ..+mkSk contains a sizable block of consecutive integers. For example; if m and n are relatively prime natural numbers, and U, U ? Vt V are integers with U-u 2 n-l , V-v 2 m-l 1 then the se...

متن کامل

Representing Integers as Sums of Squares

We study in detail the special case of Waring’s problem when the power k = 2. Ultimately, we prove that four is the least number of squares needed to represent any integer. To this end, we prove that some numbers cannot be represented as sums of two squares, some cannot be represented as sums of three, and all can be represented as sums of four. We also show that numbers of a certain form can b...

متن کامل

Chromatic roots as algebraic integers

A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on Combinatorics and Statistical Mechanics in 2008, two conjectures were proposed on the subject of which algebraic integers can be chromatic roots, known as the “α + n conjecture” and the “nα conjecture”. These say, respectively, that given any algebraic integer α there is a natural number n such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Periodica Mathematica Hungarica

سال: 2014

ISSN: 0031-5303,1588-2829

DOI: 10.1007/s10998-014-0020-9